On the Minimal Covering of Infinite Sets
نویسنده
چکیده
Klimb, J., On the minimal covering of infinite sets, Discrete Applied Mathematics 45 (1993) 161-168. Minimal covering of infinite sets is studied. It is shown that if BC2’ is closed, then /* contains a minimal covering of X. If r// is a covering of X, then fl is closed on X if and only if there is an admissible functionf: X-1 4 which has no chain. For star type set systems Theorem 15 gives a sufficient condition to contain finite covering. Notations. Let X be a set. We denote by 2x the set of all subsets of X. If B c A and B#A, we write BcA. For J&C~~, Y~Xlet &II Y={Mfl Y: MEA}. Definition 1. The set A is a covering of the set X if (1) &~2~ and (2) U&d M=X. Definition 2. JX is a minimal covering of X if (1) A is a covering of X and (2) A!'c&! implies that A’ is not a covering of X. Definition 3. Let .A be a covering of X. A is closed on X if there is a well-ordering P of & with the following property: for all x E X, the set {ME A: x E M} has a maximal element according to the well-ordering ,D. Remarks. (1) If A? is a point finite covering of X (i.e., VXE X 1 {ME .,tv: x E Correspondence to: Dr. J. KlimO, Research Institute for Telecommunication, POB 15, I525 Budapest, Hungary. 0166-218X/93/$06.00
منابع مشابه
Minimal stable sets in tournaments
We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets. We thus obtain an infinite hierarchy of tournament solutions, encompassing the top cycle, the uncovered set, the Banks set, the minimal covering set, and the tournament equilibrium set. Moreover, the hi...
متن کاملGenerated topology on infinite sets by ultrafilters
Let $X$ be an infinite set, equipped with a topology $tau$. In this paper we studied the relationship between $tau$, and ultrafilters on $X$. We can discovered, among other thing, some relations of the Robinson's compactness theorem, continuity and the separation axioms. It is important also, aspects of communication between mathematical concepts.
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملMultigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making
In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...
متن کاملLinear nonbinary covering codes and saturating sets in projective spaces
Let AR,q denote a family of covering codes, in which the covering radius R and the size q of the underlying Galois field are fixed, while the code length tends to infinity. The construction of families with small asymptotic covering densities is a classical problem in the area Covering Codes. In this paper, infinite sets of families AR,q, where R is fixed but q ranges over an infinite set of pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 45 شماره
صفحات -
تاریخ انتشار 1993